An expected polynomial time algorithm for coloring 2-colorable 3-graphs
نویسندگان
چکیده
منابع مشابه
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
We present an algorithm that colors a random 2-colorable 3-uniform hypergraph optimally in expected running time O(n5 log n).
متن کاملColoring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that either solve the problem in most but not all cases, but are of polynomial time complexity, or that give a correct solution on all input graphs while guaranteeing a polynomial running time on average only. An algorithm of the first ki...
متن کاملColoring 3-Colorable Graphs
Graph coloring in general is an extremely easy-to-understand yet powerful tool. It has wide-ranging applications from register allocation to image segmentation. For such a simple problem, however, the question is surprisingly intractable. In this section I will introduce the problem formally, as well as present some general background on graph coloring. There are several ways to color a graph, ...
متن کاملColoring k-Colorable Graphs in Constant Expected Parallel Time
A parallel (CRCW PRAM) algorithm is given to find a k-coloring of a graph randomly drawn from the family of k-colorable graphs with n vertices, where k = logO(l) n. The average running time of the algorithm is constant, and the number of processors is equal to IVI + lEI, where IVI, lEI, resp. is the number of vertices, edges, resp. of the input graph.
متن کاملA simple algorithm for 4-coloring 3-colorable planar graphs
Graph coloring for 3-colorable graphs receives very much attention by many researchers in theoretical computer science. Deciding 3-colorability of a graph is a well-known NP-complete problem. So far, the best known polynomial approximation algorithm achieves a factor of O(n0.2072), and there is a strong evidence that there would be no polynomial time algorithm to color 3-colorable graphs using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2009
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.07.077